fast multiplication factor — sparčiojo dalijimosi faktorius statusas T sritis fizika atitikmenys: angl. fast fission factor; fast multiplication factor vok. Schnellspaltfaktor, m; Schnellspaltungsfaktor, m rus. коэффициент размножения на быстрых нейтронах, m pranc. facteur… … Fizikos terminų žodynas
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
fast fission factor — sparčiojo dalijimosi faktorius statusas T sritis fizika atitikmenys: angl. fast fission factor; fast multiplication factor vok. Schnellspaltfaktor, m; Schnellspaltungsfaktor, m rus. коэффициент размножения на быстрых нейтронах, m pranc. facteur… … Fizikos terminų žodynas
Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group … Wikipedia
Fast wavelet transform — The Fast Wavelet Transform is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended… … Wikipedia
Fast Multipole Method — The Fast Multipole Method (FMM) is a mathematical technique that was developed to speed up the calculation of long ranged forces in the n body problem. It does this by expanding the system Green s function using a multipole expansion, which… … Wikipedia
facteur de multiplication rapide — sparčiojo dalijimosi faktorius statusas T sritis fizika atitikmenys: angl. fast fission factor; fast multiplication factor vok. Schnellspaltfaktor, m; Schnellspaltungsfaktor, m rus. коэффициент размножения на быстрых нейтронах, m pranc. facteur… … Fizikos terminų žodynas
Matrix multiplication — In mathematics, matrix multiplication is a binary operation that takes a pair of matrices, and produces another matrix. If A is an n by m matrix and B is an m by p matrix, the result AB of their multiplication is an n by p matrix defined only if… … Wikipedia
Kochanski multiplication — [M.J. Kochanski, Developing an RSA Chip , in Advances in Cryptology: Proceedings of CRYPTO 85 , Springer Verlag, Berlin (1985), 3 540 16463 4.] is an algorithm that allows modular arithmetic (multiplication or operations based on it, such as… … Wikipedia
Force multiplication — Force multiplication, in military usage, refers to an attribute or a combination of attributes which make a given force more effective than that same force would be without it. The expected size increase required to have the same effectiveness… … Wikipedia
Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… … Wikipedia